Efficient List Decoding for Lattices
نویسندگان
چکیده
A sub-optimal decoder for finding K vectors close to a given origin in a lattice is presented. The algorithm operates by partitioning the search space and applying a list version of the sphere decoder, enabling efficient operation for lattices of dimensions m up to and exceeding 200. The decoder is well suited to finding K highly probable sequences for the estimation of a-posteriori probabilities in iterative receivers.
منابع مشابه
New Developments in Lattice-Based Search Strategies in SRI’s Hub4 System
We describe new developments in SRI’s lattice-based progressive search strategy. These developments include the implementation of a new bigram lattice algorithm, lattice optimization techniques, and expansion of bigram lattices to trigram lattices. The new bigram lattice generation algorithm is based on generation of backtrace entries using a word-dependent N-best list decoding pass, followed b...
متن کاملIdeal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding small solutions of polynomial equations modulo integers to analogous problems over polynomial rings, number fields, and function fields. This gives us a unified view of several problems arising naturally in cryptography,...
متن کاملChinese Remainder Codes: Using Lattices to Decode Error Correcting Codes Based on Chinese Remaindering Theorem
This report is an incomplete survey of Chinese Remaindering Codes. We study the work of Goldreich, Ron and Sudan [GRS00] and Boneh [B02] which give unique and list-decoding algorithms for an error correcting code based on the Chinese Remaindering Theorem. More specifically, we will look at a decoding algorithm from [GSM00] which uniquely decodes upto (n − k) log p1 log p1+log pn errors. We will...
متن کاملEfficient root-finding algorithm with application to list decoding of Algebraic-Geometric codes
A list decoding for an error-correcting code is a decoding algorithm that generates a list of codewords within a Hamming distance from the received vector, where can be greater than the error-correction bound. In [18], a list-decoding procedure for Reed–Solomon codes [19] was generalized to algebraic–geometric codes. A recent work [8] gives improved list decodings for Reed–Solomon codes and alg...
متن کاملConstruction of Full-Diversity LDPC Lattices for Block-Fading Channels
LDPC lattices were the first family of lattices which have an efficient decoding algorithm in high dimensions over an AWGN channel. Considering Construction D’ of lattices with one binary LDPC code as underlying code gives the well known Construction A LDPC lattices or 1-level LDPC lattices. Block-fading channel (BF) is a useful model for various wireless communication channels in both indoor a...
متن کامل